-- card: 31767 from stack: in
-- bmap block id: 0
-- flags: 0000
-- background id: 11548
-- name: 


-- part contents for background part 47
----- text -----
Filed & Not Read

-- part contents for background part 46
----- text -----
In Collection

-- part contents for background part 48
----- text -----
gaul82

-- part contents for background part 49
----- text -----
Gaul, W.

-- part contents for background part 50
----- text -----
On Stochastic Analysis of Project Networks

-- part contents for background part 52
----- text -----
Deterministic and Stochastic Scheduling, Nato Advanced Study Institutes Series

-- part contents for background part 54
----- text -----
1982

-- part contents for background part 56
----- text -----
297-309

-- part contents for background part 57
----- text -----
M. A. Dempster, J. K. Lenstra, and A. H. G. Rinnooy Kan

-- part contents for background part 59
----- text -----
D. Reidel Publishing Co.

-- part contents for background part 68
----- text -----
If the activity-completion-times of a project-network are random variables the project completion-time is a random variable the distribution function of which is difficult to obtain.
This paper presents an approach using stochastic programming.

-- part contents for background part 69
----- text -----
network programming, scheduling theory, stochastic programming, finishing time